Sets of elements that pairwise generate a linear group

نویسندگان

  • John R. Britnell
  • A. Evseev
  • Robert M. Guralnick
  • P. E. Holmes
  • Attila Maróti
چکیده

Let G be any of the groups (P )GL(n, q), (P )SL(n, q). Define a (simple) graph Γ = Γ(G) on the set of elements of G by connecting two vertices by an edge if and only if they generate G. We prove that if the dimension n is at least 12 and not congruent to 2 modulo 4, then the maximum size of a complete subgraph in Γ is equal to the chromatic number of Γ. This work was motivated by a question of Blackburn.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal subsets of pairwise non-commuting elements of some finite p-groups

Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

متن کامل

Pairwise‎ ‎non-commuting elements in finite metacyclic $2$-groups and some finite $p$-groups

Let $G$ be a finite group‎. ‎A subset $X$ of $G$ is a set of pairwise non-commuting elements‎ ‎if any two distinct elements of $X$ do not commute‎. ‎In this paper‎ ‎we determine the maximum size of these subsets in any finite‎ ‎non-abelian metacyclic $2$-group and in any finite non-abelian $p$-group with an abelian maximal subgroup‎.

متن کامل

Corrigendum to "Sets of elements that pairwise generate a linear group" [J. Combin. Theory Ser. A 115 (3) (2008) 442-465]

a Department of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, UK b School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, UK c Department of Mathematics, University of Southern California, Los Angeles, CA 90089-2532, USA d DPMMS, Centre for Mathematical Sciences, University of Cambridge, Cambridge CB3 0BW, UK e Alfréd Rényi Insti...

متن کامل

Digitally Excited Reconfigurable Linear Antenna Array Using Swarm Optimization Algorithms

This paper describes the synthesis of digitally excited pencil/flat top dual beams simultaneously in a linear antenna array constructed of isotropic elements. The objective is to generate a pencil/flat top beam pair using the excitations generated by the evolutionary algorithms. Both the beams share common variable discrete amplitude excitations and differ in variable discrete phase excitations...

متن کامل

Sets of permutations that generate the symmetric group pairwise

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of 2n−1 permutations that pairwise generate the symmetric group Sn. There is no set of 2n−1 + 1 permutations having this property. For all sufficiently large integers n with n≡ 2 mod 4, there exists a set of 2n−2 even permutations that pairwise generate the alternating group An. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 115  شماره 

صفحات  -

تاریخ انتشار 2008